package demo.practice.leetcode_eveyday;

public class P863 {


   /* public List<Integer> distanceK(TreeNode root, TreeNode target, int k) {

        Map<Integer, List<Integer>> map = new HashMap<>();
        int[] depthArr = new int[]{0};
        dfs(root, map, depthArr);
    }

    public List<Integer> dfs(TreeNode root, Map<Integer, List<Integer>> map, int[] depthArr) {
        if (root != null) {
            map.put()
        }
    }*/

}
